Shortest path in a simply-connected domain having curved boundary
نویسندگان
چکیده
Given two distinct points S and E on a simply-connected domain (without holes) enclosed by a closed parametric curve, this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. SIP consists of portions of curves along with straight line segments that are tangential to the curve. The algorithm initially computes point-curve tangents and bitangents using their respective constraints. They are then analyzed further to identify potential tangents. A region check is performed to determine the tangent that will form part of SIP. Portions of the curve that belong to SIP are also identified during the process. SIP is identified without explicitly computing the length of the curves/tangents. The curve is represented using non-uniform rational B-splines (NURBS). Results of the implementation are provided.
منابع مشابه
On computing the shortest path in a multiply-connected domain having curved boundaries
Computing shortest path, overcoming obstacles in the plane, is a well-known geometric problem. However, widely assumed obstacles are polygonal in nature. Very few papers have focused on the curved obstacles, and in particular, for curved multiplyconnected domains (domains having holes). Given a set of parametric curves forming a multiply-connected domain (MCD), with one closed curve acting as a...
متن کاملShortest path in a multiply-connected domain having curved boundaries
Computing shortest path, overcoming obstacles in the plane, is a well-known geometric problem. However, widely assumed obstacles are polygonal in nature. Very few papers have focused on the curved obstacles, and in particular, for curved multiplyconnected domains (domains having holes). Given a set of parametric curves forming a multiply-connected domain (MCD), with one closed curve acting as a...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملVariational Characterization of Interior Interfaces in Phase Transition Models on Convex Plane Domains
We consider the singularly perturbed Allen-Cahn equation on a strictly convex plane domain. We show that when the perturbation parameter tends to zero there are solutions having a transition layer that tends to a straight line segment. This segment can be characterized as the shortest path intersecting the boundary orthogonally at two points.
متن کامل